Self-Repairing Mechanism of Polymer Composite
نویسندگان
چکیده
منابع مشابه
Self-organized Invasive Parallel Optimization with Self-repairing Mechanism
The parallelization of optimization algorithms is very beneficial when the function evaluations of optimization problems are time consuming. However, parallelization gets very complicated when we deal with a large number of parallel resources. In this paper, we present a framework called Self-organized Invasive Parallel Optimization (SIPO) in which the resources are self-organized. The optimiza...
متن کاملFracture Testing of a Self-Healing Polymer Composite*
Inspired by biological systems in which damage triggers an autonomic healing response, we have developed a polymer composite material that can heal itself when cracked. This paper summarizes the self-healing concept for polymeric composite materials and investigates fracture mechanics issues consequential to the development and optimization of this new class of materials. The self-healing mater...
متن کاملSelf-Repairing Mechanical Systems
This paper reviews several types of self-repairing systems developed in the Mechanical Engineering Laboratory. We have developed a modular system capable of “self-assembly” and “self-repair.” The former means a set of units can form a given shape of the system without outside help; the latter means the system restores the original shape if an arbitrary part of the system is cut off. We show bot...
متن کاملSelf-Repairing Disk Arrays
As the prices of magnetic storage continue to decrease, the cost of replacing failed disks becomes increasingly dominated by the cost of the service call itself. We propose to eliminate these calls by building disk arrays that contain enough spare disks to operate without any human intervention during their whole lifetime. To evaluate the feasibility of this approach, we have simulated the beha...
متن کاملMinimum Self-Repairing Graphs
A graph is self-repairing if it is 2-connected and such that the removal of any single vertex results in no increase in distance between any pair of remaining vertices of the graph. We completely characterize the class of minimum self-repairing graphs, which have the fewest edges for a given number of vertices. 1 Preliminaries In this paper, we investigate the class of graphs which we call self...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Society of Materials Science, Japan
سال: 2001
ISSN: 1880-7488,0514-5163
DOI: 10.2472/jsms.50.12appendix_249